/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 86183
 * Date: 2024-05-16
 * Time: 17:37
 */

public class MyLinkedList  implements  IList{
    static class ListNode {
        public int val;
        public ListNode prev;
        public ListNode next;
        public ListNode(int val){
            this.val = val;
        }

    }
    public ListNode head;
    public ListNode last;

    /**
     * 头插
     * @param data
     */
    @Override
    public void addFirst(int data) {
        ListNode node  = new ListNode(data);
        if(head == null){
            head = node;
            last = node;
            return;
        }
        node.next = head;
        head.prev = node;
        head = node;


    }

    /**
     * 尾插
     * @param data
     */
    @Override
    public void addLast(int data) {
        ListNode node  = new ListNode(data);
        if(head == null){
            head = node;
            last = node;
            return;
        }
        last.next  = node;
        node.prev = last;
        last =node;
    }

    @Override
    public void addIndex(int index, int data) {
        if(index < 0 || index >size()){
            System.out.println("index 不合法:"+ index);
            return;
        }
        if(index == 0){
            addFirst(data);
            return;
        }
        if(index == size()){
            addLast(data);

            return;
        }
        //中间位置插入
        ListNode node  = new ListNode(data);
        ListNode cur =find(index);
        node.next = cur;
        cur.prev.next = node;
        node.prev = cur.prev;
        cur.prev = node;


    }
    private ListNode find(int index){
        ListNode cur = head;
        while(index != 0){
            cur =cur.next;
            index -- ;
        }
        return cur;
    }

    @Override
    public boolean contains(int key) {
       if(head == null){
           return false;
       }
       ListNode cur = head;
       while(cur != null){
           if(cur.val == key){
               return true;
           }
           cur = cur.next;
       }
       return false;
    }

    @Override
    public void remove(int key) {
        if(head == null){
            return;
        }
      ListNode cur =head;
        while(cur != null ){
            if(cur.val == key){
                System.out.println("key = "+cur.val);
                if(cur == head){
                    if(head.next == null){
                        head =null;
                        last = null;
                    }else{
                        head = head.next;
                        head.prev = null;
                    }

                }else if(cur == last){
                    last = last.prev;
                    last.next = null;
                }else{
                    cur.prev.next = cur.next;
                    cur.next.prev = cur.prev;
                }
               return;
            }else{
                cur =cur.next;
            }
        }


    }

    @Override
    public void removeAllKey(int key) {
        if(head == null){
            return;
        }
        ListNode cur =head;
        while(cur != null ){
            if(cur.val == key){
                System.out.println("key = "+cur.val);
                if(cur == head){
                    if(head.next == null){
                        head =null;
                        last = null;
                    }else{
                        head = head.next;
                        head.prev = null;
                    }

                }else if(cur == last){
                    last = last.prev;
                    last.next = null;
                }else{
                    cur.prev.next = cur.next;
                    cur.next.prev = cur.prev;
                }
                cur =cur.next;
            }else{
                cur =cur.next;
            }
        }


    }

    @Override
    public int size() {
       if(head ==null){
           return 0;
       }
       ListNode cur = head;
       int count = 0;
       while(cur!=null){
           count++;
           cur = cur.next;
       }
       return count;
    }

    @Override
    public void clear() {
head=null;
last = null;
    }

    /**
     * 打印
     */
    @Override
    public void display() {
        ListNode cur =head;
        while(cur != null){
            System.out.print(cur.val+" ");
            cur = cur.next;
        }
        System.out.println();

    }
}
